Quantum speedups of some general-purpose numerical optimisation algorithms
نویسندگان
چکیده
منابع مشابه
Sculpting Quantum Speedups
Given a problem which is intractable for both quantum and classical algorithms, can we find a sub-problem for which quantum algorithms provide an exponential advantage? We refer to this problem as the “sculpting problem.” In this work, we give a full characterization of sculptable functions in the query complexity setting. We show that a total function f can be restricted to a promise P such th...
متن کاملHoneybees-inspired heuristic algorithms for numerical optimisation
Swarm BLOCKIN BLOCKIN intelligence BLOCKIN BLOCKIN is BLOCKIN BLOCKIN all BLOCKIN BLOCKIN about BLOCKIN BLOCKIN developing BLOCKIN BLOCKIN collective BLOCKIN BLOCKIN behaviours BLOCKIN BLOCKIN to BLOCKIN BLOCKIN solve BLOCKIN BLOCKIN complex, BLOCKIN BLOCKIN ill-‐structured BLOCKIN BLOCKIN and BLOCKIN BLOCKIN large-‐ scale problems. Efficiency in collective behaviours depends on how to harmon...
متن کاملGeneral-Purpose Spatial Decomposition Algorithms: Experimental Results
In this paper, we experimentally explore four different hierarchical space decomposition algorithms. Three of these algorithms are known from prior literature, whereas the fourth was derived as a result of initial experimental work with the previous algorithms, and is presented for the first time in this paper. The new algorithm has several variations, and one of them (called TX-AL) is consiste...
متن کاملGeneral-Purpose Parallel Simulator for Quantum Computing
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel proce...
متن کاملSome Recent Algebraic/numerical Algorithms
Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular , regarding polynomial roottnding, the solution of a polynomial system of equations, the computation of an approximate greatest common divisor of two polynomials as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Science and Technology
سال: 2020
ISSN: 2058-9565
DOI: 10.1088/2058-9565/abb003